From link-prediction in brain connectomes and protein interactomes to the local-community-paradigm in complex networks

نویسندگان

  • Carlo Vittorio Cannistraci
  • Gregorio Alanis-Lobato
  • Timothy Ravasi
چکیده

Growth and remodelling impact the network topology of complex systems, yet a general theory explaining how new links arise between existing nodes has been lacking, and little is known about the topological properties that facilitate link-prediction. Here we investigate the extent to which the connectivity evolution of a network might be predicted by mere topological features. We show how a link/community-based strategy triggers substantial prediction improvements because it accounts for the singular topology of several real networks organised in multiple local communities - a tendency here named local-community-paradigm (LCP). We observe that LCP networks are mainly formed by weak interactions and characterise heterogeneous and dynamic systems that use self-organisation as a major adaptation strategy. These systems seem designed for global delivery of information and processing via multiple local modules. Conversely, non-LCP networks have steady architectures formed by strong interactions, and seem designed for systems in which information/energy storage is crucial.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Erratum: From link-prediction in brain connectomes and protein interactomes to the local-community-paradigm in complex networks

∩ ∩ ∩ (,) = Γ() Γ() Γ() Γ() = (,) Γ() Γ() JC x y x y x y CN x y x y should read: ∩ ∪ ∪ (,) = Γ() Γ() Γ() Γ() = (,) Γ() Γ() JC x y x y x y CN x y x y The formulation for CJC ∩ (,) = (,) Γ() Γ() CJC x y CAR x y x y should read: ∪ (,) = (,) Γ() Γ() CJC x y CAR x y x y

متن کامل

Link Prediction using Network Embedding based on Global Similarity

Background: The link prediction issue is one of the most widely used problems in complex network analysis. Link prediction requires knowing the background of previous link connections and combining them with available information. The link prediction local approaches with node structure objectives are fast in case of speed but are not accurate enough. On the other hand, the global link predicti...

متن کامل

A Link Prediction Method Based on Learning Automata in Social Networks

Nowadays, online social networks are considered as one of the most important emerging phenomena of human societies. In these networks, prediction of link by relying on the knowledge existing of the interaction between network actors provides an estimation of the probability of creation of a new relationship in future. A wide range of applications can be found for link prediction such as electro...

متن کامل

Common neighbours and the local-community-paradigm for topological link prediction in bipartite networks

Bipartite networks are powerful descriptions of complex systems characterized by two different classes of nodes and connections allowed only across but notwithin the two classes. Unveiling physical principles, building theories and suggesting physicalmodels to predict bipartite links such as productconsumer connections in recommendation systems or drug–target interactions inmolecular networks c...

متن کامل

Community Detection using a New Node Scoring and Synchronous Label Updating of Boundary Nodes in Social Networks

Community structure is vital to discover the important structures and potential property of complex networks. In recent years, the increasing quality of local community detection approaches has become a hot spot in the study of complex network due to the advantages of linear time complexity and applicable for large-scale networks. However, there are many shortcomings in these methods such as in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره 3  شماره 

صفحات  -

تاریخ انتشار 2013